- generate grammar
- творильна граматика; породжувальна граматика
English-Ukrainian technical dictionary. 2015.
generate grammar
Смотреть что такое "generate grammar" в других словарях:
Grammar induction — Grammatical induction, also known as grammatical inference or syntactic pattern recognition, refers to the process in machine learning of inducing a formal grammar (usually in the form of re write rules or productions ) from a set of observations … Wikipedia
generate — gen•er•ate [[t]ˈdʒɛn əˌreɪt[/t]] v. at•ed, at•ing 1) to bring into existence; originate; produce: to generate ideas[/ex] 2) to create by a natural or chemical process: to generate heat[/ex] 3) to be a source or cause of; inspire: to generate… … From formal English to slang
generate — /jen euh rayt /, v., generated, generating. v.t. 1. to bring into existence; cause to be; produce. 2. to create by a vital or natural process. 3. to create and distribute vitally and profusely: He generates ideas that we all should consider. A… … Universalium
Context-free grammar — In formal language theory, a context free grammar (CFG) is a formal grammar in which every production rule is of the form V → w where V is a single nonterminal symbol, and w is a string of terminals and/or nonterminals (w can be empty). The… … Wikipedia
Controlled grammar — Controlled grammars[1] are a class of grammars that extend, usually, the context free grammars with additional controls on the derivations of a sentence in the language. A number of different kinds of controlled grammars exist, the four main… … Wikipedia
Formal grammar — In formal semantics, computer science and linguistics, a formal grammar (also called formation rules) is a precise description of a formal language ndash; that is, of a set of strings over some alphabet. In other words, a grammar describes which… … Wikipedia
Regular grammar — Strictly regular grammars = In computer science, a right regular grammar (also called right linear grammar) is a formal grammar ( N , Σ, P , S ) such that all the production rules in P are of one of the following forms: # A → a where A is a non… … Wikipedia
Unrestricted grammar — In formal language theory, an unrestricted grammar is a formal grammar on which no restrictions are made on the left and right sides of the grammar s productions. This is the most general class of grammars in the Chomsky–Schützenberger hierarchy … Wikipedia
Context-sensitive grammar — A context sensitive grammar (CSG) is a formal grammar in which the left hand sides and right hand sides of any production rules may be surrounded by a context of terminal and nonterminal symbols. Context sensitive grammars are more general than… … Wikipedia
Two-level grammar — A two level grammar is either one of two formal structures: # A formal grammar for a two level formal language, which is a formal language specified at two levels, for example, the levels of words and sentences.Fact|date=February 2007 # A formal… … Wikipedia
HEBREW GRAMMAR — The following entry is divided into two sections: an Introduction for the non specialist and (II) a detailed survey. [i] HEBREW GRAMMAR: AN INTRODUCTION There are four main phases in the history of the Hebrew language: the biblical or classical,… … Encyclopedia of Judaism
